Search results for "Discrete cosine transform"
showing 10 items of 20 documents
Exploration of the Oxynoticeratidae ornamental morphospace using the discrete cosine transform (DCT) to analyze rib patterns.
2006
The discrete cosine transform (DCT) is a Fourier-related transform widely used in signal processing and well suited to analyzing open outlines such as ammonite ribs. The method is applied here to depict and decipher the ribbing morphospace of a large group of Lower Jurassic ammonites composed of the Oxynoticeratidae and their close ancestors. Because they are clearly associated with buoyancy and/or swimming ability, the usually clearly involute, comparatively smooth and compressed shells of these ammonites may well be misleading taxonomic markers. In this context, quantitative analysis of the ribbing pattern using the DCT may significantly improve our perception of the ornamental patterns e…
Novel Iris Biometric Watermarking Based on Singular Value Decomposition and Discrete Cosine Transform
2014
Published version of an article in the journal: Mathematical Problems in Engineering. Also available from the publisher at: http://dx.doi.org/10.1155/2014/926170 A novel iris biometric watermarking scheme is proposed focusing on iris recognition instead of the traditional watermark for increasing the security of the digital products. The preprocess of iris image is to be done firstly, which generates the iris biometric template from person's eye images. And then the templates are to be on discrete cosine transform; the value of the discrete cosine is encoded to BCH error control coding. The host image is divided into four areas equally correspondingly. The BCH codes are embedded in the sing…
Perceptual adaptive insensitivity for support vector machine image coding.
2005
Support vector machine (SVM) learning has been recently proposed for image compression in the frequency domain using a constant epsilon-insensitivity zone by Robinson and Kecman. However, according to the statistical properties of natural images and the properties of human perception, a constant insensitivity makes sense in the spatial domain but it is certainly not a good option in a frequency domain. In fact, in their approach, they made a fixed low-pass assumption as the number of discrete cosine transform (DCT) coefficients to be used in the training was limited. This paper extends the work of Robinson and Kecman by proposing the use of adaptive insensitivity SVMs [2] for image coding u…
Ownership protection of plenoptic images by robust and reversible watermarking
2018
Abstract Plenoptic images are highly demanded for 3D representation of broad scenes. Contrary to the images captured by conventional cameras, plenoptic images carry a considerable amount of angular information, which is very appealing for 3D reconstruction and display of the scene. Plenoptic images are gaining increasing importance in areas like medical imaging, manufacturing control, metrology, or even entertainment business. Thus, the adaptation and refinement of watermarking techniques to plenoptic images is a matter of raising interest. In this paper a new method for plenoptic image watermarking is proposed. A secret key is used to specify the location of logo insertion. Employing discr…
Linear transform for simultaneous diagonalization of covariance and perceptual metric matrix in image coding
2003
Two types ofredundancies are contained in images: statistical redundancy and psychovisual redundancy. Image representation techniques for image coding should remove both redundancies in order to obtain good results. In order to establish an appropriate representation, the standard approach to transform coding only considers the statistical redundancy, whereas the psychovisual factors are introduced after the selection ofthe representation as a simple scalar weighting in the transform domain. In this work, we take into account the psychovisual factors in the de8nition of the representation together with the statistical factors, by means of the perceptual metric and the covariance matrix, res…
Data Compression Using Wavelet and Local Cosine Transforms
2015
The chapter describes an algorithm that compresses two-dimensional data arrays, which are piece-wise smooth in one direction and have oscillating events in the other direction. Seismic, hyper-spectral and fingerprints data, for example, have such a mixed structure. The transform part of the compression process is an algorithm that combines wavelet and local cosine transform (LCT). The quantization and the entropy coding parts of the compression are taken from the SPIHT codec. To efficiently apply the SPIHT codec to a mixed coefficients array, reordering of the LCT coefficients takes place. On the data arrays, which have the mixed structure, this algorithm outperforms other algorithms that a…
The effect of wavelet and discrete cosine transform compression of digital radiographs on the detection of subtle proximal caries. ROC analysis.
2007
The study compared diagnostic performances of 2 different image compression methods: JPEG (discrete cosine transform; Joint Photographic Experts Group compression standard) versus JPEG2000 (discrete wavelet transform), both at a compression ratio of 12:1, from the original uncompressed TIFF radiograph with respect to the detection of non-cavitated carious lesions. Therefore, 100 approximal surfaces of 50 tooth pairs were evaluated on the radiographs by 10 experienced observers using a 5-point confidence scale. Observations were carried out on a standardized viewing monitor under subdued light conditions. The proportion of diseased surfaces was balanced to approximately 50% to avoid bias. Tr…
Hybrid blind robust image watermarking technique based on DFT-DCT and Arnold transform
2018
In this paper, a robust blind image watermarking method is proposed for copyright protection of digital images. This hybrid method relies on combining two well-known transforms that are the discrete Fourier transform (DFT) and the discrete cosine transform (DCT). The motivation behind this combination is to enhance the imperceptibility and the robustness. The imperceptibility requirement is achieved by using magnitudes of DFT coefficients while the robustness improvement is ensured by applying DCT to the DFT coefficients magnitude. The watermark is embedded by modifying the coefficients of the middle band of the DCT using a secret key. The security of the proposed method is enhanced by appl…
A blind Robust Image Watermarking Approach exploiting the DFT Magnitude
2019
Due to the current progress in Internet, digital contents (video, audio and images) are widely used. Distribution of multimedia contents is now faster and it allows for easy unauthorized reproduction of information. Digital watermarking came up while trying to solve this problem. Its main idea is to embed a watermark into a host digital content without affecting its quality. Moreover, watermarking can be used in several applications such as authentication, copy control, indexation, Copyright protection, etc. In this paper, we propose a blind robust image watermarking approach as a solution to the problem of copyright protection of digital images. The underlying concept of our method is to a…
Importance of quantiser design compared to optimal multigrid motion estimation in video coding
2000
Adaptive flow computation and DCT quantisation play complementary roles in motion compensated video coding schemes. Since the introduction of the intuitive entropy-constrained motion estimation of Dufaux et al. (1995), several optimal variable-size block matching algorithms have been proposed. Many of these approaches put forward their intrinsic optimality, but the corresponding visual effect has not been explored. The relative importance of optimal multigrid motion estimation with regard to quantisation is addressed in the context of MPEG-like coding. It is shown that while simpler (suboptimal) motion estimates give subjective results as good as the optimal motion estimates, small enhancem…